/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    bool evaluateTree(TreeNode* root)
    {
        if (root->left == nullptr && root->right == nullptr)
        {
            if (root->val == 1) return true;
            else return false;
        }

        bool b1 = evaluateTree(root->left);
        bool b2 = evaluateTree(root->right);
        if (root->val == 2) return b1 || b2;
        else  return b1 && b2;

        return -1;
    }
};